Fractal Image Compression Using Quadtree Decomposition and Huffman Coding

نویسنده

  • A. G. Ananth
چکیده

Fractal image compression can be obtained by dividing the original grey level image into unoverlapped blocks depending on a threshold value and the well known techniques of Quadtree decomposition. By using threshold value of 0.2 and Huffman coding for encoding and decoding of the image these techniques have been applied for the compression of satellite imageries. The compression ratio (CR) and Peak Signal to Noise Ratio (PSNR) values are determined for three types of images namely standard Lena image, Satellite Rural image and Satellite Urban image. The Matlab simulation results show that for the Quad tree decomposition approach shows very significant improvement in the compression ratios and PSNR values derived from the fractal compression with range block and iterations technique. The results indicate that for a Lena image C R is 2.02 and PSNR values is 29.92, Satellite Rural image 3.08 and 29.34, Satellite urban image 5.99 and 28.12 respectively The results are presented and discussed in this paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Faster fractal image compression using quadtree recomposition

In this paper, we present a fractal image compression algorithm employing a new quadtree recomposition (QR) approach. In this approach, quadtree subblocks of an image are iteratively recombined into larger blocks for fractal coding. For complex images, this approach exhibits superior runtime performance, when compared to a classical quadtree decomposition (QD) scheme, while maintaining high del...

متن کامل

Parallel Pipelined Fractal Image Compression using Quadtree Recomposition

In this paper we present a model and experimental results for performing parallel fractal image compression using circulating pipeline computation and employing a new quadtree recomposition approach. A circular linear array of processors is employed and utilized in a pipelined fashion. In this approach, a modification of the scheme given by Jackson and Blom, quadtree sub-blocks of an image are ...

متن کامل

Fractal based Image Compression techniques - A progress Report

One well-known loss-less image technique is DCT-based JPEG compression that is quite effective at low or moderate compression ratios, up to ratios of 20 or 25 to 1. Beyond this point, the image becomes very “blocky” as the compression increases and the image quality becomes too poor for practical use. Another drawback of JPEG compression is its resolution dependence. In order to “zoom-in” on a ...

متن کامل

Lossy Image Compression Using Discrete Wavelet Transform and Thresholding Techniques

Results of lossy image compression using wavelet transforms and several thresholding techniques are presented here. The analyzed image was divided into little sub-images and each one was decomposed in a vector following a Hilbert fractal curve. The wavelet transform was applied to each vector and some of the high frequency components were suppressed based on some threshold criteria. Different l...

متن کامل

A Novel Multiscale Fractal Image Coding Algorithm based on SIMD Parallel Hardware

Progressive coding techniques are becoming more and more important as they enable quick browsing of large image databases. Fractal image compression is not intrinsically suitable for hierarchical schemes, but the proposed algorithm yields interesting results thanks to a set of new features. The main novelties are the introduction of a residual coding approach, the use of a quadtree decompositio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012